Random walk based node sampling in self-organizing networks
نویسندگان
چکیده
منابع مشابه
Learning Networks from Random Walk-Based Node Similarities
Digital presence in the world of online social media entails significant privacy risks [6, 10, 33, 58, 34]. In this work we consider a privacy threat to a social network in which an attacker has access to a subset of random walk-based node similarities, such as effective resistances (i.e., commute times) or personalized PageRank scores. Using these similarities, the attacker’s goal is to infer ...
متن کاملRandom sampling: Billiard Walk algorithm
Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. Nevertheless, in practice the number of steps required to achieve uniformly distributed samples is rather high. We propose new random walk algorithm based on billiard trajectories. Numerical experiments demonstrate much faster convergence to uniform distribution.
متن کاملSampling Online Social Networks by Random Walk with Indirect Jumps
Random walk-based sampling methods are gaining popularity and importance in characterizing large networks. While powerful, they suffer from the slow mixing problem when the graph is loosely connected, which results in poor estimation accuracy. Random walk with jumps (RWwJ) can address the slow mixing problem but it is inapplicable if the graph does not support uniform vertex sampling (UNI). In ...
متن کاملRevisiting random walk based sampling in networks: evasion of burn-in period and frequent regenerations
Background In the framework of network sampling, random walk (RW) based estimation techniques provide many pragmatic solutions while uncovering the unknown network as little as possible. Despite several theoretical advances in this area, RW based sampling techniques usually make a strong assumption that the samples are in stationary regime, and hence are impelled to leave out the samples collec...
متن کاملMarkov Dynamics based on Link-node-link Random Walk to Reveal Link Communities in Complex Networks
Discovery of communities in complex networks is a fundamental data analysis problem with many applications in various domains. Most of the existing approaches have focused on discovering communities of nodes, while recent studies have shown great advantage and utility of the knowledge of communities of links in networks. Aiming to address this new problem, we introduce a stochastic model based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGOPS Operating Systems Review
سال: 2006
ISSN: 0163-5980
DOI: 10.1145/1151374.1151386